DHT algorithm based on encoding algebraic integers
نویسندگان
چکیده
Introduction: The discrete Hartley transform (DHT) is an attractive alternative to the discrete Fourier transform (DFT) because of its real-valued computation and properties similar to those of the DFT [1]. Another interesting property of the DHT is that the same kernel is used for both the transform and its inverse transform. Consequently, since its introduction the DHT has found its way to many digital signal processing applications [2]. The 1-D DHT of a N-point sequence {xn, n = 0,...,N-1 and N = 2 } is defined as:
منابع مشابه
A new DCT algorithm based on encoding algebraic integers
In this paper we introduce an algebraic integer encoding scheme for the basis matrix elements of DCTs and IDCTs. In particular, we encode the function and generate the other matrix elements using standard trigonometric identities. This encoding technique eliminates the requirement to approximate the matrix elements; rather we use algebraic ‘placeholders’ for them. Using this encoding scheme we ...
متن کاملCayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is commonly recognized that the primary difficulty in designing DHT is not in static DHT topologies, but in the dynamic DHT algorithm which adapts various static DHT topologies to a dynamic network at Internet. As a direct co...
متن کاملPolynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices
We show that a modified variant of the interior point method can solve linear programs (LPs) whose coefficients are real numbers from a subring of the algebraic integers. By defining the encoding size of such numbers to be the bit size of the integers that represent them in the subring, we prove the modified algorithm runs in time polynomial in the encoding size of the input coefficients, the d...
متن کاملAlgebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Real DFTs
In this paper we systematically derive a large class of fast general-radix algorithms for various types of real discrete Fourier transforms (real DFTs) including the discrete Hartley transform (DHT) based on the algebraic signal processing theory. This means that instead of manipulating the transform definition, we derive algorithms by manipulating the polynomial algebras underlying the transfo...
متن کاملError-Free Arithmetic for Discrete Wavelet Transforms Using Algebraic Integers
In this paper a novel encoding scheme is introduced with applications to error-free computation of Discrete Wavelet Transforms (DWT) based on Daubechies wavelets. The encoding scheme is based on an algebraic integer decomposition of the wavelet coefficients. This work is a continuation of our research into error-free computation of DCTs and IDCTs, and this extension is timely since the DWT is p...
متن کامل